Predictor-corrector interior point method for contact analysis models with multi-point constraints

Predictor-Corrector Primal-Dual Interior Point Method for Solving Economic Dispatch Problems: A Postoptimization Analysis

This paper proposes a predictor-corrector primal-dual interior point method which introduces line search procedures IPLS in both the predictor and corrector steps. The Fibonacci search technique is used in the predictor step, while an Armijo line search is used in the corrector step. The method is developed for application to the economic dispatch ED problem studied in the field of power system...

Parallel Predictor-Corrector Interior-Point Algorithm of Structured Optimization Problems

Automated inspection of Printed Circuit Boards(PCB's) is essential if 100% repeatible inspection is to be carried out. The cost of most commercially available systems for automatic visual inspection of PCB's are beyond the reach of many small to medium manufacturers. The principle objectives of our research is to develop and integrate a micro-computer based image analysis system specifically fo...

The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method

GPU Predictor-Corrector Interior Point Method for Large-Scale Linear Programming

This master’s thesis concerns the implementation of a GPUaccelerated version of Mehrotra’s predictor-corrector interior point algorithm for large-scale linear programming (LP). The implementations are tested on LP problems arising in the financial industry, where there is high demand for faster LP solvers. The algorithm was implemented in C++, MATLAB and CUDA, using double precision for numeric...

Corrector-predictor arc-search interior-point algorithm for $P_*(kappa)$-LCP acting in a wide neighborhood of the central path

In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...